Evolution of cooperation on dynamical graphs

There are two key characteristic of animal and human societies: (1) degree heterogeneity, meaning that not all individual have the same number of associates; and (2) the interaction topology is not static, i.e. either individuals interact with different set of individuals at different times of their life, or at least they have different associations than their parents. Earlier works have shown that population structure is one of the mechanisms promoting cooperation. However, most studies had assumed that the interaction network can be described by a regular graph (homogeneous degree distribution). Recently there are an increasing number of studies employing degree heterogeneous graphs to model interaction topology. But mostly the interaction topology was assumed to be static. Here we investigate the fixation probability of the cooperator strategy in the prisoner's dilemma, when interaction network is a random regular graph, a random graph or a scale-free graph and the interaction network is allowed to change. We show that the fixation probability of the cooperator strategy is lower when the interaction topology is described by a dynamical graph compared to a static graph. Even a limited network dynamics significantly decreases the fixation probability of cooperation, an effect that is mitigated stronger by degree heterogeneous networks topology than by a degree homogeneous one. We have also found that from the considered graph topologies the decrease of fixation probabilities due to graph dynamics is the lowest on scale-free graphs.